An Evolutionary and Local Search Algorithm for Planning Two Manipulators Motion
نویسندگان
چکیده
A method based on the union of an Evolutionary Algorithm (EA) and a local search algorithm for obtaining coordinated motion plans of two manipulator robots is presented. A Decoupled Planning Approach has been used. For this purpose, the problem has been decomposed into two subproblems: path planning, where a collision-free path is found for each robot independently of the other, only considering fixed obstacles; and trajectory planning, where the paths are timed and synchronized in order to avoid collision with the other robot. This paper focuses on the second problem. A method is presented to minimize the total motion time of two manipulators along their paths, avoiding collision regardless of the accuracy of the dynamic model used. A hybrid technique with EA and local search methods has been implemented.
منابع مشابه
An evolutionary and local search algorithm for motion planning of two manipulators
A method for obtaining coordinated motion plans of robot manipulators is presented. A decoupled planning approach has been used; that is, the problem has been decomposed into two subproblems: path planning, where a collision-free path is found for each robot independently only considering fixed obstacles, and trajectory planning, where the paths are timed and synchronized to avoid collisions wi...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملOn the modeling and the optimal motion planning of manipulators via a modified D* Lite search algorithm
Abstract: The motion planning of the manipulators is a topic in robotics that has been studied extensively and there are many solutions available in the literature. However, the motion planning of manipulators considering the system dynamics with respect to their energy consumption level is still a challenging problem which requires a combination of interdisciplinary studies to yield an optimal...
متن کاملA Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کامل